FDPLL — A First-Order Davis-Putnam-Logeman-Loveland Procedure

FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure

A First-Order Logic Davis-Putnam-Logemann-Loveland Procedure

The Davis-Putnam-Logemann-Loveland procedure (DPLL) was introduced in the early 60s as a proof procedure for first-order logic. Nowadays, only its propositional logic core component is widely used in efficient propositional logic provers and respective applications. This success motivates to reconsider lifting DPLL to the first-order logic level in a more contemporary way, by exploiting success...

Approximate analysis of search algorithms with "physical" methods

An overview of some methods of statistical physics applied to the analysis of algorithms for optimization problems (satisfiability of Boolean constraints, vertex cover of graphs, decoding, ...) with distributions of random inputs is proposed. Two types of algorithms are analyzed: complete procedures with backtracking (Davis-Putnam-Loveland-Logeman algorithm) and incomplete, local search procedu...

The Taming of the (X)OR

Many key verification problems such as bounded model-checking, circuit verification and logical cryptanalysis are formalized with combined clausal and affine logic (i.e. clauses with xor as the connective) and cannot be efficiently (if at all) solved by using CNF-only provers. We present a decision procedure to efficiently decide such problems. The GaussDPLL procedure is a tight integration in ...

Theory decision by decomposition

The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formula in such a way that its definitional part, including the theory, can be compiled by a rewrite-based firstorder theorem prover, and the residual problem can be decided by an SMT-solver, based on the Davis-Putnam-Logemann...